An HMM learning algorithm for minimizing an error function on all training data.
نویسندگان
چکیده
منابع مشابه
An Active Learning Algorithm Based on Existing Training Data
A multilayer perceptron is usually considered a passive learner that only receives given training data. However, if a multilayer perceptron actively gathers training data that resolve its uncertainty about a problem being learnt, sufficiently accurate classification is attained with fewer training data. Recently, such active learning has been receiving an increasing interest. In this paper, we ...
متن کاملAn Efficient Adaptive Boundary Matching Algorithm for Video Error Concealment
Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged motion vectors (MVs). This algorithm uses an outer boundary matching or directional tempo...
متن کاملAn Evolutionary Programming Based Algorithm for HMM training
In this paper, we propose an evolutionary programming (EP) based algorithm for the training of hidden Markov models (HMMs), which are applied to automatic speech recognition. This algorithm (called the EP algorithm) uses specially designed operators of mutation and selection to find the HMM parameters and the number of states. In order to evaluate the recognition capability of the HMMs trained ...
متن کاملAn Algorithm for Modeling and Interpretation of Seismoelectric Data
Generally speaking, seismoelectric modeling is a prospecting method based on seismic and electromagnetic waves, in which waves generated by a seismic source at the boundary of the two environments generate a relative fluid-solid motion formed as a result of antagonism between the elastic properties of the environment with the saturated fluid. This research has as its objective, a study of the e...
متن کاملAn improved opposition-based Crow Search Algorithm for Data Clustering
Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Acoustical Society of Japan (E)
سال: 1992
ISSN: 0388-2861,2185-3509
DOI: 10.1250/ast.13.369